RACK SHADOWS AND THEIR INVARIANTS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spectrahedra and Their Shadows

eingereichte Habilitationsschrift zur Erlangung des akademischen Grades doctor rerum naturalium habilitatus Die Annahme der Habilitationsschrift haben empfohlen:

متن کامل

Enhancements of rack counting invariants via dynamical cocycles

We introduce the notion of N-reduced dynamical cocycles and use these objects to define enhancements of the rack counting invariant for classical and virtual knots and links. We provide examples to show that the new invariants are not determined by the rack counting invariant, the Jones polynomial or the generalized Alexander polynomial.

متن کامل

Splice Graphs and their Vertex-Degree-Based Invariants

Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.

متن کامل

L–eta–invariants and Their Approximation by Unitary Eta–invariants

Cochran, Orr and Teichner introduced L–eta–invariants to detect highly non–trivial examples of non slice knots. Using a recent theorem by Lück and Schick we show that their metabelian L–eta–invariants can be viewed as the limit of finite dimensional unitary representations. We recall a ribbon obstruction theorem proved by the author using finite dimensional unitary eta–invariants. We show that ...

متن کامل

splice graphs and their vertex-degree-based invariants

let g_1 and g_2 be simple connected graphs with disjoint vertex sets v(g_1) and v(g_2), respectively. for given vertices a_1in v(g_1) and a_2in v(g_2), a splice of g_1 and g_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the :union: of g_1 and g_2. in this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Knot Theory and Its Ramifications

سال: 2011

ISSN: 0218-2165,1793-6527

DOI: 10.1142/s0218216511009315